A denotational semantics for continuous queries over streams and relations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations

Despite the recent surge of research in query processing over data streams, little attention has been devoted to defining precise semantics for continuous queries over streams. We first present an abstract semantics based on several building blocks: formal definitions for streams and relations, mappings among them, and any relational query language. From these basics we define a precise interpr...

متن کامل

Continuous Queries over Data Streams - Semantics and Implementation

Recent technological advances have pushed the emergence of a new class of data-intensive applications that require continuous processing over sequences of transient data, called data streams, in near real-time. Examples of such applications range from business activity monitoring and online analysis of sensor data to trend detection in stock ticker data. This work presents a solid and powerful ...

متن کامل

Multiple Continuous Queries Evaluation over Data Streams

Query processing for data streams should be continuous and rapid, which requires strict time constraint. In most previous researches, in order to guarantee this constraint, the evaluation order of join predicates in a continuous query is optimized by a greedy. However, the greedy strategy traces only the first promising plan, so that it often finds a sub-optimal plan. This paper proposes an imp...

متن کامل

A Temporal Foundation for Continuous Queries over Data Streams

Despite the surge of research in continuous stream processing, there is still a semantical gap. In many cases, continuous queries are formulated in an enriched SQL-like query language without specifying the semantics of such a query precisely enough. To overcome this problem, we present a sound and precisely defined temporal operator algebra over data streams ensuring deterministic query result...

متن کامل

Semantics based Buffer Reduction for Queries over XML Data Streams

With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buffer scale may increase exponentially, which can cause memory bottleneck. Some optimization techniques have been proposed to solve the problem. However, the limit of these techniques has been defined by a concurrency low...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMOD Record

سال: 2004

ISSN: 0163-5808

DOI: 10.1145/1031570.1031572